1,923 research outputs found
Classical and Quantum Evaluation Codesat the Trace Roots
We introduce a new class of evaluation linear codes by evaluating polynomials at the roots of a suitable trace function. We give conditions for self-orthogonality of these codes and their subfield-subcodes with respect to the Hermitian inner product. They allow us to construct stabilizer quantum codes over several finite fields which substantially improve the codes in the literature. For the binary case, we obtain records at http://codetables.de/. Moreover, we obtain several classical linear codes over the field F 4 which are records at http://codetables.de/
New Quantum Codes from Evaluation and Matrix-Product Codes
Stabilizer codes obtained via CSS code construction and Steane's enlargement
of subfield-subcodes and matrix-product codes coming from generalized
Reed-Muller, hyperbolic and affine variety codes are studied. Stabilizer codes
with good quantum parameters are supplied, in particular, some binary codes of
lengths 127 and 128 improve the parameters of the codes in
http://www.codetables.de. Moreover, non-binary codes are presented either with
parameters better than or equal to the quantum codes obtained from BCH codes by
La Guardia or with lengths that can not be reached by them
Stabilizer quantum codes from -affine variety codes and a new Steane-like enlargement
New stabilizer codes with parameters better than the ones available in the
literature are provided in this work, in particular quantum codes with
parameters and that are records.
These codes are constructed with a new generalization of the Steane's
enlargement procedure and by considering orthogonal subfield-subcodes --with
respect to the Euclidean and Hermitian inner product-- of a new family of
linear codes, the -affine variety codes
New binary and ternary LCD codes
LCD codes are linear codes with important cryptographic applications.
Recently, a method has been presented to transform any linear code into an LCD
code with the same parameters when it is supported on a finite field with
cardinality larger than 3. Hence, the study of LCD codes is mainly open for
binary and ternary fields. Subfield-subcodes of -affine variety codes are a
generalization of BCH codes which have been successfully used for constructing
good quantum codes. We describe binary and ternary LCD codes constructed as
subfield-subcodes of -affine variety codes and provide some new and good LCD
codes coming from this construction
- …